AN AODV-based clustering and routing scheme for mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the aid of any fixed communication infrastructure. Due to limited resources, frequent network partitions and unpredictable topological changes, proactive clustering schemes incur high overheads in this environment. In this paper, we propose an on-demand, distributed clustering algorithm for MANETs based on an Ad hoc On-demand Distance Vector (AODV) routing protocol. The use of on-demand routing protocol information for clustering reduces clustering overhead because no clusters are maintained unless they are needed. The clustering algorithm’s stability was assessed using clustering metrics such as cluster head and cluster members lifetime. Based on this clustering scheme, a cluster-based routing protocol was proposed to add scalability to the AODV routing protocol. Using simulation, a comparison was made with a pure AODV protocol. Simulation experiments show that the scheme results in stable and scalable clusters and Cluster- AODV routing introduces less overhead than the pure AODV protocol without clustering1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

The design and simulation of routing protocols for mobile ad hoc networks.

Thesis (Ph.D.)-University of Natal, Durban, 2000.This thesis addresses a novel type of network known as a mobile ad hoc network. A mobile ad hoc network is a collection of entirely mobile nodes that can establish communication in the absence of any fixed infrastructure. Envisioned applications of these networks include virtual classrooms, emergency relief operations, military tactical communications, sensor networks and community networking. Mobile ad hoc networking poses several new challenges in the design of network protocols. This thesis focuses on the routing problem. The main challenges in the design of a routing protocol for mobile ad hoc networks result from them having limited resources and there being frequent topological changes that occur unpredictably. Moreover, there is no fixed infrastructure that supports routing. The conventional routing protocols are not generally suitable for mobile ad hoc networks, as they cannot react quickly to the changing network topology, cause excessive communication and computation, or converge very slowly creating routing loops. In this thesis we propose two classes of routing schemes for mobile ad hoc networks. The first class is known as Limited Flooding Protocol. The protocol is fully reactive and does not require the computation of routing tables. It uses some basic principles of flooding, but reduces the communication overhead by restricting packet propagation through the network. Several variations of limited flooding are considered including deterministic, randomised and priority-based mechanisms. The main advantage of this protocol is that it can be used in networks with unpredictable topological changes and highly mobile nodes, since maintaining routing table at the intermediate nodes is not required. The second class of routing protocols is based on hierarchical clustering architecture and is intended for use in a relatively low mobility environment. The basic idea of this protocol is to partition the entire network into smaller units known as clusters and define routing mechanisms both within and between clusters using a hierarchical architecture. The main advantage of this architecture is reduction of storage requirements of routing information, communication overhead and computational overhead at each node. Discrete-event simulation is used for modelling and performance evaluation. Various options and variations of the protocols are examined in the…[Page 2 of abstract is missing.]Page 2 of abstract is missing

Canine Pose Estimation: A Computing for Public Safety Solution

In this paper we discuss determining canine pose in the context of common poses observed in Urban Search and Rescue dogs through the use a sensor network made up of accelerometers. We discuss the use of the Canine Pose Estimation System in a disaster environment, and propose techniques for determining canine pose. In addition we discuss the challenges with this approach in such environments. This paper presents the experimental results obtained from the Heavy Urban Search and Rescue disaster simulation, where experiments were conducted using multiple canines, which show that angles can be derived from acceleration readings. Our experiments show that similar angles were measured for each of the poses, even when measured on multiple USAR canines of varying size. We also developed an algorithm to determine poses and display the current canine pose to the screen of a laptop. The algorithm was successful in determining some poses and had difficulty with others. These results are presented and discussed in this paper

Enhancing Canine Disaster Search

This paper describes canine augmentation technology (CAT) for use in urban search and rescue (USAR). CAT is a WiFi enabled sensor array that is worn by a trained canines deployed in urban disasters. The system includes, but is not limited to, cameras that provide emergency responders with real-time data to remotely monitor, analyze and take action during USAR operations. An analysis is made of the current tools available to USAR workers including rescue robots and canine search teams. From this analysis came the design of CAT-a system that extracts the strengths of each available USAR tool and combines them to compliment each other. Our experiments yield promising results that CAT may provide significant help to rescuers

Wireless Mesh Network Performance for Urban Search and Rescue Missions

in this paper we demonstrate that the Canine Pose Estimation (CPE) system can provide a reliable estimate for some poses and when coupled with effective wireless transmission over a mesh network. Pose estimates are time sensitive, thus it is important that pose data arrives at its destination quickly. Propagation delay and packet delivery ratio measuring algorithms were developed and used to appraise Wireless Mesh Network (WMN) performance as a means of carriage for this time-critical data. The experiments were conducted in the rooms of a building where the radio characteristics closely resembled those of a partially collapsed building-a typical US&R environment. This paper presents the results of the experiments, which demonstrate that it is possible to receive the canine pose estimation data in realtime although accuracy of the results depend on the network size and the deployment environment

AN AODV-based clustering and routing scheme for mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the aid of any fixed communication infrastructure. Due to limited resources, frequent network partitions and unpredictable topological changes, proactive clustering schemes incur high overheads in this environment. In this paper, we propose an on-demand, distributed clustering algorithm for MANETs based on an Ad hoc On-demand Distance Vector (AODV) routing protocol. The use of on-demand routing protocol information for clustering reduces clustering overhead because no clusters are maintained unless they are needed. The clustering algorithm’s stability was assessed using clustering metrics such as cluster head and cluster members lifetime. Based on this clustering scheme, a cluster-based routing protocol was proposed to add scalability to the AODV routing protocol. Using simulation, a comparison was made with a pure AODV protocol. Simulation experiments show that the scheme results in stable and scalable clusters and Cluster- AODV routing introduces less overhead than the pure AODV protocol without clustering1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

Exploiting node localization for performance improvement of vehicular delay-tolerant networks

“Copyright © [2010] IEEE. Reprinted from IEEE International Conference on Communications (IEEE ICC 2010) - General Symposium on Selected Areas in Communications (ICC'10 SAS).ISSN:1550-3607. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Networks (VDTNs) are characterized by high node mobility, intermittent connectivity, and short contact durations. Such factors cause incomplete transmissions and the waste of link capacity. To address these issues, this paper explores the use of node localization in VDTNs. The exchange of signaling information related to nodes’ real-time location, current trajectory, velocity, and transmit range allows a Contact Prediction Algorithm to estimate contact durations. This information can be used in conjunction with additional signaling information (e.g. link data rate), to determine the maximum number of bytes that can be transmitted during contact opportunities. A Contact Duration Scheduling Policy can use this information to prevent incomplete transmissions, while increasing the number of successfully relayed bundles and improving data link utilization. Through a simulation study, we investigate the benefits of introducing the concept of node localization, and evaluate the performance of the proposed Contact Prediction Algorithm and Contact Duration Scheduling Policy. We demonstrate the gains introduced by this approach in comparison with an environment where VDTN nodes have no access to localization information.Part of this work has been supported by Instituto de Telecomunicações, Next Generation Networks and Applications Group (NetGNA), Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence from the Seventh Framework Programme of EU

MP-Collaborator: a mobile collaboration tool in pervasive environment

“Copyright © [2009] IEEE. Reprinted from 5th International Conference on Wireless and Mobile Computing, Networking and Communications. WIMOB 2009. ISBN: 978-0-7695-3841-9 . This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”In modern organizations, the communication between collaborators is essential to improve productivity. There is a need for mobile collaboration tools that allow efficient collaboration among staff in organization which may be located in different geographical areas and time zones. Mobile and pervasive computing provides easy and convenient access to information, enabling effective collaboration. This paper describes a context and location-aware mobile application, called MP-Collaborator, created to improve and optimize the communication between collaborators in any organization. MP- Collaborator draws information from location, user status and Pocket Outlook Calendar to create a user availability profile, which is published to any other user in the network. Based on availability status, the user can be reached using a simple phone call or a message. Through the opportunistic use of available mobile technologies MP-Collaborator provides a simple but critical service - user presence service. The proposed solution is validated both in terms of features and communication through a series of experiments on real devices through Wi-Fi network